Semi-Stable and Stage Extensions as 2-valued Models

نویسندگان

  • Mauricio Osorio
  • Juan Carlos Nieves
چکیده

This paper introduces the characterizations of both semi-stable and stage extensions in terms of 2-valued logical models. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming counterparts of the notion of range which is a coined concept in argumentation semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Range-based argumentation semantics as two-valued models

Characterizations of semi-stable and stage extensions in terms of 2-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming counterparts of the notion of range which is an established concept in argumentation semantics.

متن کامل

Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming

In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [6] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumenta...

متن کامل

CEGARTIX v2017-3-13: A SAT-Based Counter-Example Guided Argumentation Reasoning Tool

We present CEGARTIX, version 2017-3-13, for the International Competition on Computational Models of Argumentation (ICCMA) 2017. Main changes are the addition of support for more reasoning tasks, relying on variations of existing Boolean encodings. The tool CEGARTIX is now capable of deciding credulous and skeptical acceptance, and enumeration of all (or up to a pre-specified bound) extensions ...

متن کامل

Complete Extensions in Argumentation Coincide with Three-Valued Stable Models in Logic Programming

In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [8] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumenta...

متن کامل

Ideal extensions as logical programming models

We show that the ideal sets of an argumentation framework can be characterized by two kinds of logical models: ideal models (2-valued logical models) and p-stable models (2-valued logical models). We also show that the maximal ideal set of an argumentation framework can be characterized by the well-founded+ model (a 3-valued logical model). These results argue for the logical foundations of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015